Semiquantum key distribution with secure delegated quantum computation
نویسندگان
چکیده
منابع مشابه
Semiquantum key distribution with secure delegated quantum computation
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to acc...
متن کاملEavesdropping in semiquantum key distribution protocol
The quantum key distribution protocol with classical Bob, well known as semiquantum key distribution, has been proposed a few years back (Boyer et al., PRL 2007, PRA 2009). In this protocol Alice has the same capability as in the traditional BB84 protocol, but Bob is limited by the constraint that he can measure or prepare qubits only in {|0〉, |1〉} basis and reflect any other qubit (or in other...
متن کاملExperimentally feasible protocol for semiquantum key distribution
Quantum key distribution (QKD) protocols make it possible for two quantum parties to generate a secret shared key. Semiquantum key distribution (SQKD) protocols, such as “QKD with classical Bob” and “QKD with classical Alice” (that have both been proven robust), achieve this goal even if one of the parties is classical. However, existing SQKD protocols are not experimentally feasible with curre...
متن کاملQuantum-enhanced secure delegated classical computing
We present a family of quantumly-enhanced protocols to achieve unconditionally secure delegated classical computation where the client and the server have both their classical and quantum computing capacity limited. We prove the same task cannot be achieved using only classical protocols. This extends the work of Anders and Browne on the computational power of correlations to a security setting...
متن کاملUnconditionally Secure Multipartite Quantum Key Distribution
We consider the problem of secure key distribution among n trustful agents: the goal is to distribute an identical random bit-string among the n agents over a noisy channel such that eavesdroppers learn little about it. We study the general situation where the only resources required are secure bipartite key distribution and authenticated classical communication. Accordingly, multipartite quant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2016
ISSN: 2045-2322
DOI: 10.1038/srep19898